Recent Advances in Mathematical Programming with Semi-continuous Variables and Cardinality Constraint
نویسندگان
چکیده
Mathematical programming problems with semi-continuous variables and cardinality constraint have many applications, including production planning, portfolio selection, compressed sensing and subset selection in regression. This class of problems can be modeled as mixed-integer programs with special structures and are in general NP-hard. In the past few years, based on new reformulations, approximation and relaxation techniques, promising exact and approximate methods have been developed. We survey in this paper these recent developments for this challenging class of mathematical programming problems.
منابع مشابه
Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
This paper considers optimization problems with cardinality constraints. Based on a recently introduced reformulation of this problem as a nonlinear program with continuous variables, we first define some problem-tailored constraint qualifications and then show how these constraint qualifications can be used to obtain suitable optimality conditions for cardinality constrained problems. Here, th...
متن کاملA Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
متن کاملStructural Properties of Affine Sparsity Constraints
We introduce a new constraint system for sparse variable selection in statistical learning. Such a system arises when there are logical conditions on the sparsity of certain unknown model parameters that need to be incorporated into their selection process. Formally, extending a cardinality constraint, an affine sparsity constraint (ASC) is defined by a linear inequality with two sets of variab...
متن کاملA Continuous Optimization Model for Partial Digest Problem
The pupose of this paper is modeling of Partial Digest Problem (PDP) as a mathematical programming problem. In this paper we present a new viewpoint of PDP. We formulate the PDP as a continuous optimization problem and develope a method to solve this problem. Finally we constract a linear programming model for the problem with an additional constraint. This later model can be solved by the simp...
متن کاملA General Scalar-Valued Gap Function for Nonsmooth Multiobjective Semi-Infinite Programming
For a nonsmooth multiobjective mathematical programming problem governed by infinitely many constraints, we define a new gap function that generalizes the definitions of this concept in other articles. Then, we characterize the efficient, weakly efficient, and properly efficient solutions of the problem utilizing this new gap function. Our results are based on $(Phi,rho)-$invexity,...
متن کامل